Cyclotomic structures on root lattices

نویسنده

  • Mark Reeder
چکیده

The centralizer C(w) of an element w in a Weyl group W plays an important role in the structure and representation theory of split reductive groups G over finite and p-adic fields k, where W is the absolute Weyl group of G. If k is finite, this is well-known: the element w determines a maximal ktorus Tw ⊂ G and C(w) may be identified with the k-rational points in the Weyl group W (Tw, G) of Tw in G. For every character χ of Tw(k), the DeligneLusztig construction [12] gives a virtual representation R Tw(χ) of G(k) whose self-intertwining number is the order of the stabilizer of χ in C(w). If k is p-adic then w determines an unramified maximal k-torus Tw, which now can be embedded as a maximal torus in G in several ways. Assume G is simply-connected. Each class in the Galois cohomology group H(k, Tw) determines an embedding Tw ↪→ G and two classes in H(k, Tw) give G(k)-conjugate embeddings iff they are conjugate under the natural action of C(w) on H(k, Tw). Let C(w, ρ) be the stabilizer of the class ρ ∈ H(k, Tw). If Tw ∼ → T ρ w ⊂ G is an embedding belonging to the class ρ ∈ H(Tw, G), then C(w) is isomorphic to the big Weyl group of k-rational elements in W (T ρ w, G) and C(w, ρ) is isomorphic to the small Weyl group of elements in W (T ρ w, G) which have representatives in G(k). On the representation theory side, suppose w is elliptic (i.e. Tw is anisotropic) and χ is a sufficiently regular character of Tw(k). Then, in accordance with the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices

The coordination sequence of a lattice L encodes the word-length function with respect toM , a set that generates L as a monoid. We investigate the coordination sequence of the cyclotomic lattice L = Z[ζm], where ζm is a primitive m th root of unity and where M is the set of all m roots of unity. We prove several conjectures by Parker regarding the structure of the rational generating function ...

متن کامل

Computations of Cyclotomic Lattices

We study even modular lattices of leveì and dimension 2(p ? 1), p prime, which arise from the ideal class group of the p-th cyclotomic extension of Q(p ?`). After giving the basic theory we concentrate on Galois-invariant ideals , obtain computational results on minimal vectors and isometries, and identify several old or new extremal lattices.

متن کامل

ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices

In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers 3 [ ]  where 3  is a...

متن کامل

Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings

Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is called principle ideal problem (PIP). Its goal is to find a generators of any principle ide...

متن کامل

Polynomial Time Reduction from Approximate Shortest Vector Problem to Principal Ideal Problem for Lattices in Some Cyclotomic Rings

Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is the principal ideal problem (PIP). Its goal is to find a generator of any principal ideal i...

متن کامل

The closest vector problem in tensored root lattices of type A and in their duals

In this work we consider the closest vector problem (CVP) —a problem also known as maximum-likelihood decoding— in the tensor of two root lattices of type A (Am⊗An), as well as in their duals (Am⊗An). This problem is mainly motivated by lattice based cryptography, where the cyclotomic rings Z[ζc] (resp. its co-different Z[ζc]) play a central role, and turn out to be isomorphic as lattices to te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006